#include <iostream>
#include <queue>
using namespace std;

struct jungle {
	int dis, fuel;
};

int main()
{
	int n, l, p;
	cin >> n;
	jungle da[n];
	for (int i = 0; i < n; i++) cin >> da[i].dis >> da[i].fuel;
	cin >> l >> p;
	for (int i = 0; i < n; i++) da[i].dis = l - da[i].dis;
	return 0;
}
